Multiple Objective Linear Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Duality in Multiple Objective Linear Programming

We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can be traced back to the old Greeks. We show that there is an inclusion reversing one-to-one map between the minimal faces of the image of the primal objective and the maximal faces of the image of the dual objective map.

متن کامل

Forecasting Using Fuzzy Multiple Objective Linear Programming

The application of fuzzy approach models to forecast has been drawing a lot of attention. This study proposes a fuzzy approach to forecasting using a financial data set. The methodology used is multiple objective linear programming (MOLP). Selecting an individual forecast based upon a single objective may not make the best use of available information for a variety of reasons. Combined forecast...

متن کامل

On duality in multiple objective linear programming

We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...

متن کامل

Using objective values to start multiple objective linear programming algorithms

We introduce in this paper a new starting mechanism for multiple-objective linear programming (MOLP) algorithms. This makes it possible to start an algorithm from any solution in objective space. The original problem is first augmented in such a way that a given starting solution is feasible. The augmentation is explicitly or implicitly controlled by one parameter during the search process, whi...

متن کامل

Characterizing Complete Weak Efficiency in Multiple Objective Linear Programming

ABSTRACT The phenomenon consisting in all the feasible region of a multiple objective linear programming problem being weakly efficient, may be less unlikely than has been believed, particularly for problems whose feasible regions have no interior. To deal with such possibility of complete weak efficiency, we would want to have at our disposal proficient methods to check this situation. So, in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TANMIYAT AL-RAFIDAIN

سال: 2009

ISSN: 2664-276X

DOI: 10.33899/tanra.2009.161784